Hesitant intuitionistic fuzzy algorithm for multiobjective optimization problem

نویسندگان

چکیده

Every real-life optimization problem with uncertainty and hesitation can not be a single objective, consequently, class of multiobjective linear problems (MOLOP) appears in the literature. Further, experts assign values uncertain parameters, expert’s opinions about parameters are conflicting nature. There concerning methods based on fuzzy sets, or their other versions available literature that only covers partial hesitation, but hesitant intuitionistic sets provides collective understanding MOLOP under it also reflects better practical aspects decision-making MOLOP. In this context, paper defines membership function nonmembership to tackle parameters. Here, new solution called Pareto optimal is defined, some theorems stated proved. For MOLOP, we develop an iterative method, illustrative example shows superiority proposed method. And lastly, calculated results compared popular methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Particle Swarm Optimization Algorithm for a Supplier Clustering Problem

This paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. During recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions is usually complex and unstructured. In general, many quantitative and qualitative factors, such as quality, price, and fl...

متن کامل

fuzzy particle swarm optimization algorithm for a supplier clustering problem

this paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. during recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. however, the nature of these decisions is usually complex and unstructured. in general, many quantitative and qualitative factors, such as quality, price, and fl...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

An Objective Penalty Functions Algorithm for Multiobjective Optimization Problem

By using the penalty function method with objective parameters, the paper presents an interactive algorithm to solve the inequality constrained multi-objective programming (MP). The MP is transformed into a single objective optimal problem (SOOP) with inequality constrains; and it is proved that, under some conditions, an optimal solution to SOOP is a Pareto efficient solution to MP. Then, an i...

متن کامل

New Operations over Interval Valued Intuitionistic Hesitant Fuzzy Set

Hesitancy is the most common problem in decision making, for which hesitant fuzzy set can be considered as a useful tool allowing several possible degrees of membership of an element to a set. Recently, another suitable means were defined by Zhiming Zhang [1], called interval valued intuitionistic hesitant fuzzy sets, dealing with uncertainty and vagueness, and which is more powerful than the h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operational Research

سال: 2022

ISSN: ['1866-1505', '1109-2858']

DOI: https://doi.org/10.1007/s12351-021-00685-8